Minimum time broadcast in faulty star networks
نویسندگان
چکیده
منابع مشابه
Minimum time broadcast in faulty star networks
In this paper we give new results on the fault{tolerance capabilities of the star graph. We rst consider the problem of determining the maximum number r(n) of vertices in a n! vertices star graph S n such that by removing any set of vertices and/or edges from S n of cardinality at most r(n) the diameter of S n does not increase. Subsequently, we give an algorithm for broadcasting a message in S...
متن کاملOptimal Time Broadcasting in Faulty Star Networks
This paper investigates fault-tolerant broadcasting in star networks. We propose a non-adaptive single-port broadcasting scheme in the n-star network such that it tolerates n 2 faults in the worst case and completes the broadcasting in O(n log n) time. The existence of such a broadcasting scheme was not known before. A new technique, called di using-and-disseminating, is introduced into the sch...
متن کاملThe Minimum Broadcast Time Problem for Several Processor Networks
Broadcasting is the information dissemination process in a communication network. A subset of processors V, c Vcalled originators knows an unique message which has to be transferred by calls between adjacent processors. Each call requires one time unit and each processor can participate in at most one call per time unit. The problem is to find a schedule such that the time needed to inform all ...
متن کاملGirth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کاملOptimal Time Broadcasting Schemes in Faulty Star Graphs
We propose two fault-tolerant broadcasting schemes in star graphs. One of the schemes can tolerate up to n − 2 faults of the crash type in the n-star graph. The other scheme can tolerate up to ⌊ n−3d−1 2 ⌋ faults of the Byzantine type in the n-star graph, where d is the smallest positive integer satisfying n ≤ d!. Each of the schemes is designed for the single-port mode, and it completes the br...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1998
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)00106-6